Reconstruction of matrices from submatrices

نویسندگان

  • Géza Kós
  • Péter Ligeti
  • Péter Sziklai
چکیده

For an arbitrary matrix A of n×n symbols, consider its submatrices of size k×k, obtained by deleting n−k rows and n−k columns. Optionally, the deleted rows and columns can be selected symmetrically or independently. We consider the problem of whether these multisets determine matrix A. Following the ideas of Krasikov and Roditty in the reconstruction of sequences from subsequences, we replace the multiset by the sum of submatrices. For k > cn2/3 we prove that the matrix A is determined by the sum of the k × k submatrices, both in the symmetric and in the nonsymmetric cases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Targeted matrix completion

Matrix completion is a problem that arises in many dataanalysis settings where the input consists of a partiallyobserved matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume that the input partially-observed matrix is low rank. The success of these methods depends on the number of observed entries and the rank of the matrix; the larg...

متن کامل

Uniform uncertainty principle for Bernoulli and subgaussian ensembles

In [CT1] Candes and Tao studied problems of approximate and exact reconstruction of sparse signals from incomplete random measurements and related them to the eigenvalue behavior of submatrices of matrices of random measurements. In particular they introduced the notion they called the uniform uncertainty principle (UUP, defined below) and studied it for Gaussian, Bernoulli and Fourier ensemble...

متن کامل

Eigenvectors of block circulant and alternating circulant matrices

The eigenvectors and eigenvalues of block circulant matrices had been found for real symmetric matrices with symmetric submatrices, and for block circulant matrices with circulant submatrices. The eigenvectors are now found for general block circulant matrices, including the Jordan Canonical Form for defective eigenvectors. That analysis is applied to Stephen J. Watson’s alternating circulant m...

متن کامل

Rank-deficient submatrices of Kronecker products of Fourier matrices

We provide a set of maximal rank-deficient submatrices of a Kronecker product of two matrices A ⊗ B, and in particular the Kronecker product of Fourier matrices F = Fn1 ⊗ . . . ⊗ Fnk . We show how in the latter case, maximal rank-deficient submatrices can be constructedas tilings of rank-one blocks. Such tilings exist for any subgroup of a suitable Abelian group associated to the matrix F . The...

متن کامل

Rank-deficient submatrices of Fourier matrices

We consider the maximal rank-deficient submatrices of Fourier matrices. We do this by considering a hierarchical subdivision of these matrices into low rank blocks. We also explore some connections with the FFT, and with an uncertainty principle for Fourier transforms over finite Abelian groups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2009